A penalty linear programming method using reduced-gradient basis-exchange techniques
نویسندگان
چکیده
منابع مشابه
Extensions of the Multiplicative Penalty Function Method for Linear Programming
We shall extend Iri's multiplicative penalty function method for linear programming [41 so that it can handle the problem of unknown optimum value of the objective function, without solving both primal and dual problems simultaneously, and generate convergent dual solutions. By making use of these dual variables, lower bounds of the optimum objective function value are updated efficiently, whic...
متن کاملAn interior-point piecewise linear penalty method for nonlinear programming
We present an interior-point penalty method for nonlinear programming (NLP), where the merit function consists of a piecewise linear penalty function (PLPF) and an `2-penalty function. The PLPF is defined by a set of penalty parameters that correspond to break points of the PLPF and are updated at every iteration. The `2-penalty function, like traditional penalty functions for NLP, is defined b...
متن کاملOn using exterior penalty approaches for solving linear programming problems
In this research effort, we study three exterior penalty function approaches for solving linear programming problems. These methods are an active set l 2 penalty approach (ASL2), an inequality-equality based l 2 penalty approach (IEL2), and an augmented Lagrangian approach (ALAG). Particular effective variants are presented for each method, along with comments and experience on alternative algo...
متن کاملReduced basis method for linear elasticity problems with many parameters ∗
The reduced basis (RB) methods are proposed here for the solution of parametrized equations in linear elasticity problems. The fundamental idea underlying RB methods is to decouple the generation and projection stages (offline/online computational procedures) of the approximation process in order to solve parametrized equations in a rapid, inexpensive and reliable way. The method allows importa...
متن کاملUsing an Efficient Penalty Method for Solving Linear Least Square Problem with Nonlinear Constraints
In this paper, we use a penalty method for solving the linear least squares problem with nonlinear constraints. In each iteration of penalty methods for solving the problem, the calculation of projected Hessian matrix is required. Given that the objective function is linear least squares, projected Hessian matrix of the penalty function consists of two parts that the exact amount of a part of i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1980
ISSN: 0024-3795
DOI: 10.1016/0024-3795(80)90227-x